Embedding problem

#	Item
41	Shortest Non-Crossing Walks in the Plane∗ Jeff Erickson Amir Nayyeri Department of Computer Science Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:15:47 Network theory Tree Graph embedding Planar graph Shortest path problem Induced path Routing algorithms Biased graph Planar separator theorem Graph theory Mathematics Topological graph theory
42	Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2013-01-06 00:21:58 Combinatorial optimization NP-complete problems Cut Maximum flow problem Graph embedding Matching Vertex cover Big O notation Graph coloring Mathematics Theoretical computer science Graph theory